Combinatorial Optimization through Statistical Instance-Based Learning
نویسندگان
چکیده
Different successful heuristic approaches have been proposed for solving combinatorial optimization problems. Commonly, each of them is specialized to serve a different purpose or address specific difficulties. However, most combinatorial problems that model real world applications have a priori well known measurable properties. Embedded machine learning methods may aid towards the recognition and utilization of these properties for the achievement of satisfactory solutions. In this paper, we present a heuristic methodology which employs the instance-based machine learning paradigm. This methodology can be adequately configured for several types of optimization problems which are known to have certain properties. Experimental results are discussed concerning two well known problems, namely the knapsack problem and the set partitioning problem. These results show that the proposed approach is able to find significantly better solutions compared to intuitive search methods based on heuristics which are usually applied to the specific problems.
منابع مشابه
Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملMaking Choices Using Structure at the Instance Level exploiting Case Based Reasoning
Constraint programming (CP) and Integer Linear Programming (IP) are both highly successful technologies for solving a wide variety of combinatorial optimization problems. When modelling a combinatorial optimization problem, there is often a choice about what technology to use to solve that problem. For instance in the Bid Evaluation problem (BEP) –a combinatorial optimization problem arising in...
متن کاملAlgorithm Selection for Sorting and Probabilistic Inference : a Machine Learning - Based Approach
The algorithm selection problem aims at selecting the best algorithm for a given computational problem instance according to some characteristics of the instance. In this dissertation, we first introduce some results from theoretical investigation of the algorithm selection problem. We show, by Rice’s theorem, the nonexistence of an automatic algorithm selection program based only on the descri...
متن کاملLearning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
We propose a new approach to understanding the algorithm-specific empirical hardness of NP-Hard optimization problems. In this work we focus on the empirical hardness of the winner determination problem—an optimization problem arising in combinatorial auctions—when solved by ILOG’s CPLEX software. We consider nine widely-used problem distributions and sample randomly from a continuum of paramet...
متن کامل